Spectral characterizations of signed lollipop graphs
نویسندگان
چکیده
منابع مشابه
Spectral characterizations of sandglass graphs
The sandglass graph is obtained by appending a triangle to each pendant vertex of a path. It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra. © 2009 Elsevier Ltd. All rights reserved.
متن کاملSpectral Characterizations of Dumbbell Graphs
A dumbbell graph, denoted by Da,b,c, is a bicyclic graph consisting of two vertexdisjoint cycles Ca, Cb and a path Pc+3 (c > −1) joining them having only its end-vertices in common with the two cycles. In this paper, we study the spectral characterization w.r.t. the adjacency spectrum of Da,b,0 (without cycles C4) with gcd(a, b) > 3, and we complete the research started in [J.F. Wang et al., A ...
متن کاملSpectral Analysis of k-Balanced Signed Graphs
Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectral analysis on graphs with both positive and negative edges. Specifically, we investigate the impacts of introducing negative edges and examine patterns in the spectral space of the graph’s adjacency matrix. Our theoretical res...
متن کاملOn spectral partitioning of signed graphs
Classical spectral clustering is based on a spectral decomposition of a graph Laplacian, obtained from a graph adjacency matrix representing positive graph edge weights describing similarities of graph vertices. In signed graphs, the graph edge weights can be negative to describe disparities of graph vertices, for example, negative correlations in the data. Negative weights lead to possible neg...
متن کاملDevelopments on spectral characterizations of graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency matrix and the Laplacian matrix were addressed. Furthermore, we formulated some research questions on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.04.022